package ch.ethz.fcl.metrobuzz.algorithm.sort.heapsort;

public class HeapSortTest {
	public static void main(String[] args) {
		HeapSort heaptest = new HeapSort();
		for (int i = 0; i < 1000; i++) {
			heaptest.addNum(10000 * (float) Math.random());
		}
		System.out.println("Unsorted Data");

		for (int i = 0; i < heaptest.getUnsortedData().size(); i++) {
			System.out
					.print(heaptest.getUnsortedData().get(i).getValue() + " ");
		}
		System.out.println("\nSorted Data");
		for (int i = 0; i < heaptest.getSortedData().size(); i++) {
			System.out.print(heaptest.getSortedData().get(i).getValue() + " ");
		}
	}

}
